/**
 * @author LKQ
 * @date 2022/2/2 15:43
 * @description 按位异或，然后统计1的数量
 */
public class FormalSolution {
    public static void main(String[] args) {

    }
    public int hammingDistance(int x, int y) {
        return Integer.bitCount(x ^ y);
    }

}
